Problem:
 a(s(x1)) -> s(s(s(p(s(b(p(p(s(s(x1))))))))))
 b(s(x1)) -> s(s(s(p(p(s(s(c(p(s(p(s(x1))))))))))))
 c(s(x1)) -> p(s(p(s(a(p(s(p(s(x1)))))))))
 p(p(s(x1))) -> p(x1)
 p(s(x1)) -> x1

Proof:
 Bounds Processor:
  bound: 2
  enrichment: match
  automaton:
   final states: {5,4,3,2}
   transitions:
    p1(60) -> 61*
    p1(35) -> 36*
    p1(30) -> 31*
    p1(20) -> 21*
    p1(62) -> 63*
    p1(34) -> 35*
    p1(19) -> 20*
    p1(28) -> 29*
    p1(23) -> 24*
    s1(25) -> 26*
    s1(37) -> 38*
    s1(32) -> 33*
    s1(22) -> 23*
    s1(17) -> 18*
    s1(59) -> 60*
    s1(29) -> 30*
    s1(24) -> 25*
    s1(61) -> 62*
    s1(36) -> 37*
    s1(26) -> 27*
    s1(38) -> 39*
    s1(33) -> 34*
    s1(18) -> 19*
    a1(58) -> 59*
    c1(31) -> 32*
    b1(21) -> 22*
    p2(66) -> 67*
    p2(68) -> 69*
    a0(1) -> 2*
    s0(1) -> 1*
    p0(1) -> 5*
    b0(1) -> 3*
    c0(1) -> 4*
    1 -> 5,17
    17 -> 67,21,29
    18 -> 20,66,28
    22 -> 24*
    27 -> 59,61,4,2
    29 -> 31*
    31 -> 58*
    32 -> 69*
    33 -> 35,68
    39 -> 22,24,3
    59 -> 61*
    61 -> 63*
    63 -> 32,4
    67 -> 21*
    69 -> 36*
  problem:
   
  Qed